Random Serial Dictatorship: The One and Only
نویسنده
چکیده
Fix a Pareto optimal, strategy proof and non-bossy deterministic matching mechanism and define a random matching mechanism by assigning agents to the roles in the mechanism via a uniform lottery. Given a profile of preferences, the lottery over outcomes that arises under the random matching mechanism is identical to the lottery that arises under random serial dictatorship, where the order of dictators is uniformly distributed. This result extends the celebrated equivalence between the core from random endowments and random serial dictatorship to the grand set of all Pareto optimal, strategy proof and non-bossy matching mechanisms.
منابع مشابه
The Computational Complexity of Random Serial Dictatorship
In social choice settings with linear preferences, random dictatorship is known to be the only social decision scheme satisfying strategyproofness and ex post efficiency. When also allowing indifferences, random serial dictatorship (RSD) is a well-known generalization of random dictatorship that retains both properties. RSD has been particularly successful in the special domain of random assign...
متن کاملStrategyproof Quota Mechanisms for Multiple Assignment Problems
We study the problem of allocating multiple objects to agents without transferable utilities, where each agent may receive more than one object according to a quota. Under lexicographic preferences, we characterize the set of strategyproof, non-bossy, and neutral quota mechanisms and show that under a mild Pareto efficiency condition, serial dictatorship quota mechanisms are the only mechanisms...
متن کاملAsymptotic ordinal inefficiency of random serial dictatorship
We establish that the fraction of preference profiles for which the random serial dictatorship allocation is ordinally efficient vanishes for allocation problems with many object types. We consider also a probabilistic setting where in expectation agents have moderately similar preferences reflecting varying popularity across objects. In this setting we show that the probability that the random...
متن کاملMaximal Recursive Rule: A New Social Decision Scheme
In social choice settings with strict preferences, random dictatorship rules were characterized by Gibbard [1977] as the only randomized social choice functions that satisfy strategyproofness and ex post efficiency. In the more general domain with indifferences, RSD (random serial dictatorship) rules are the well-known and perhaps only known generalization of random dictatorship. We present a n...
متن کاملOn Manipulablity of Random Serial Dictatorship in Sequential Matching with Dynamic Preferences
We consider the problem of repeatedly matching a set of alternatives to a set of agents in the absence of monetary transfer. We propose a generic framework for evaluating sequential matching mechanisms with dynamic preferences, and show that unlike single-shot settings, the random serial dictatorship mechanism is manipulable.
متن کامل